منابع مشابه
Finding the Most Likely Trajectories of Optimally-Controlled Stochastic Systems
Optimal trajectories of deterministic systems satisfy Pontryagin’s maximum principle and can be computed efficiently. Related results for stochastic systems exist but they lack the simplicity and computational efficiency of the deterministic case. Here we show that a certain class of both discrete-time and continuous-time nonlinear stochastic control problems obey a classic maximum principle, i...
متن کاملMost Likely Landslide Initiation Points
A new method for determination of Most Likely Initiation Points and the evaluation of Digital Terrain Model scale in terrain stability mapping P. Tarolli and D. G. Tarboton Department of Land and Agroforest Environments, AGRIPOLIS, University of Padova, 35020 Legnaro, Padova, Italy Department of Civil and Environmental Engineering, Utah State University, Logan, Utah, USA Received: 10 January 20...
متن کاملFinding the Most Likely Infection Path in Networks with Limited Information
In this paper we address the problem of identifying the most likely infection pattern responsible for the spread of a disease in a network. In particular, we focus on the scenario where limited information (i.e. infection reports) is available during an ongoing outbreak. For this problem we propose a maximum likelihood model and present an integer programming formulation. The objective of the m...
متن کاملFinding Most Likely Haplotypes in General Pedigrees Through Parallel Search with Dynamic Load Balancing
General pedigrees can be encoded as Bayesian networks, where the common MPE query corresponds to finding the most likely haplotype configuration. Based on this, a strategy for grid parallelization of a state-of-the-art Branch and Bound algorithm for MPE is introduced: independent worker nodes concurrently solve subproblems, managed by a Branch and Bound master node. The likelihood functions are...
متن کاملFinding the most parsimonious or likely tree in a network with respect to an alignment
Phylogenetic networks are often constructed by merging multiple conflicting phylogenetic signals into a directed acyclic graph. It is interesting to explore whether a network constructed in this way induces biologically-relevant phylogenetic signals that were not present in the input. Here we show that, given a multiple alignment A for a set of taxa X and a rooted phylogenetic network N whose l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2009
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-009-9218-2